Two design principles of geometric algorithms in finite-precision arithmetic
نویسندگان
چکیده
منابع مشابه
Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic
Two methods are proposed for correct and verifiable geometric reasoning using finite precision arithmetic. The first method, data normalization, transforms the geometric structure into a configuration for which all finite precision calculations yield correct answers. The second method, called the hidden variable method, constructs configurations that belong to objects in an infinite precision d...
متن کاملArbitrary precision real arithmetic: design and algorithms
We describe here a representation of computable real numbers and a set of algorithms for the elementary functions associated to this representation. A real number is represented as a sequence of nite B-adic numbers and for each classical function (rational, algebraic or transcendental), we describe how to produce a sequence representing the result of the application of this function to its argu...
متن کاملTwo Types of Geometric–Arithmetic Index of V–phenylenic Nanotube
The concept of geometric-arithmetic indices was introduced in the chemical graph theory. These indices are defined by the following general formula: ( ) 2 ( ) uv E G u v u v Q Q Q Q GA G , where Qu is some quantity that in a unique manner can be associated with the vertex u of graph G. In this paper the exact formula for two types of geometric-arithmetic index of Vphenylenic nanotube ar...
متن کاملRobust explicit MPC design under finite precision arithmetic
We propose a design methodology for explicit Model Predictive Control (MPC) that guarantees hard constraint satisfaction in the presence of finite precision arithmetic errors. The implementation of complex digital control techniques, like MPC, is becoming increasingly adopted in embedded systems, where reduced precision computation techniques are embraced to achieve fast execution and low power...
متن کاملMatrix Powers in Finite Precision Arithmetic
If A is a square matrix with spectral radius less than 1 then A k 0 as k c, but the powers computed in finite precision arithmetic may or may not converge. We derive a sufficient condition for fl(Ak) 0 as k x) and a bound on [[fl(Ak)[[, both expressed in terms of the Jordan canonical form of A. Examples show that the results can be sharp. We show that the sufficient condition can be rephrased i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1989
ISSN: 0893-9659
DOI: 10.1016/0893-9659(89)90022-0